The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees
نویسندگان
چکیده
We consider the problem of finding a shortest rectilinear Steiner tree for a given set of points in the plane in the presence of rectilinear obstacles that must be avoided. We extend the Steiner ratio to the obstacle-avoiding case and show that it is equal to the Steiner ratio for the obstacle-free case.
منابع مشابه
Optimal Rectilinear Steiner Tree Routing in the Presence of Obstacles
|This paper presents a new model for VLSI routing in the presence of obstacles, that transforms any routing instance from a geometric problem into a graph problem. It is the rst model that allows computation of optimal obstacle-avoiding rectilinear Steiner trees in time corresponding to the instance size (the number of terminals and obstacle border segments) rather than the size of the routing ...
متن کاملISPD: FOARS: FLUTE Based Obstacle-Avoiding Rectilinear Steiner Tree Construction
In this paper, we present an algorithm called FOARS for obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction. FOARS applies a top-down approach which first partitions the set of pins into several subsets uncluttered by obstacles. Then an obstacle-avoiding Steiner tree is generated for each subset by an obstacle aware version of the rectilinear Steiner minimal tree (RSMT) alg...
متن کاملA catalog of Hanan grid problems
We present a general rectilinear Steiner tree problem in the plane and prove that it is solvable on the Hanan grid of the input points. This result is then used to show that several variants of the ordinary rectilinear Steiner tree problem are solvable on the Hanan grid, including | but not limited to | Steiner trees for rectilinear (or iso-thetic) polygons, obstacle-avoiding Steiner trees, gro...
متن کاملRouting a Multi-Terminal Critical Net: Steiner Tree Construction in the Presence of Obstacles
This paper presents a new model for VLSI routing in the presence of obstacles, that transforms any routing instance from a geometric problem into a graph problem. It is the first model that allows computation of optimal obstacle-avoiding rectilinear Steiner trees in time corresponding to the instance size (the number of terminals and obstacle border segments) rather than the size of the routing...
متن کاملPerformance Analysis of the Algorithms forthe Construction of Multilayer Obstacle Avoiding Rectilinear Steiner Minimum Tree
Routing is a phase in the physical design of Electronic Circuits. The main aim of routing in VLSI design is to interconnect the cells that have been assigned positions as a solution of the placement problem. The problem of finding Rectilinear SteinerMinimal Tree (RSMT) is one of the fundamental problems in the field of Electronic Design Automation. The obstacle avoiding rectilinear Steiner mini...
متن کامل